A Relative Bandwidth Allocation Method Enabling Fast Convergence in XCP

نویسندگان

  • Hanh Le Hieu
  • Kenji Masui
  • Katsuyoshi Iida
چکیده

The eXplicit Control Protocol (XCP), which explicitly sends feedback information on the current network resource condition to endhosts to control congestion, is a promising protocol for the network supported congestion control that will be needed in the future Internet. Because of its flexibility, XCP can provide relative bandwidth allocation service that is impossible with other protocols. However, with the existing version of this XCP service, the convergence time to network stability is long due to the gradual resource allocation. We have analyzed the existing allocation method and propose a new allocation method for use at XCP routers. The effectiveness of the proposed method has been evaluated through simulation and the results are discussed here.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving XCP to Achieve Max-Min Fair Bandwidth Allocation

TCP is shown to be inefficient and instable in high speed and long latency networks. The eXplicit Control Protocol (XCP) is a new and promising protocol that outperforms TCP in terms of efficiency, stability, queue size, and convergence speed. However, Low et al. recently discovered a weakness of XCP. In a multi-bottleneck environment, XCP may achieve as low as 80% utilization at a bottleneck l...

متن کامل

Decoupling congestion control and bandwidth allocation policy with application to high bandwidth-delay product networks

In this dissertation, we propose a new architecture for Internet congestion control that decouples the control of congestion from the bandwidth allocation policy. We show that the new protocol, called XCP, enables very large per-flow throughput (e.g., more than 1 Gb/s), which is unachievable using current congestion control. Additionally, we show via extensive simulations that XCP significantly...

متن کامل

A Distributed Algorithm for Max-min Bandwidth Sharing: The Asynchronous Case

Dense Wavelength Division Multiplexing (DWDM), dedicated optical paths, highspeed switches, and high speed routers are giving rise to networks with plentifulbandwidth in the core. In such networks, bottlenecks and congestion are concen-trated at the edge and at end nodes. We consider how end nodes should efficientlyand fairly manage capacity across multiple sessions with finite ...

متن کامل

Tradeoffs of Implementing TCP Fairness Schemes

In this paper we consider two recently proposed schemes for the fair allocation of bandwidth in high speed networks carrying TCP traffic: XCP and FairShare. We explain the different design philosophies represented by each one and demonstrate through a set of simulations that FairShare, by making better use of the round-trip-time information, avoids the performance shortcomings that appear in XC...

متن کامل

Lightweight Fairness Solutions for XCP and TCP Cohabitation

XCP is a promising router-assisted protocol due to its high performance and intra-protocol fairness in fully XCP networks. However, XCP is not inter-operable with current E2E protocols resulting in a poor performance of XCP flows when the resources are shared with TCP-like flows. In this paper, we propose a lightweight fairness solution, that can benefit the cohabitation between XCP and TCP in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010